Mutual definability does not imply definitional equivalence, a simple example
نویسندگان
چکیده
We give two theories, Th1 and Th2, which are explicitly definable over each other (i.e. the relation symbols of one theory are explicitly definable in the other, and vice versa), but are not definitionally equivalent. The languages of the two theories are disjoint.
منابع مشابه
The Role of Definitions in Construction and Analysis of Formal Ontologies
In this paper I make the case that formal characterisation of large conceptual vocabularies does not require the specification of large numbers of axioms but can be carried out primarily in terms of definitions. Axioms should be confined to describing the logical properties of a relatively small core of primitives. I examine some technical meta-logical notions and theorems relating to definitio...
متن کاملArithmetical definability over finite structures
Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform and . We prove finite analogs of three classic results in arithmetical definability, namely that and TIMES can first-order define PLUS, that and DIVIDES can first-order define TIM...
متن کاملDefinitional Issues in Functional Encryption
We provide a formalization of the emergent notion of “functional encryption,” as well as introduce various security notions for it, and study relations among the latter. In particular, we show that indistinguishability and semantic security based notions of security are inequivalent for functional encryption in general; in fact, “adaptive” indistinguishability does not even imply “non-adaptive”...
متن کاملThe Undecidability of λ-Definability
In this article, we shall show that the Plotkin-Statman conjecture [?, ?] is false. The conjecture was that, in a model of the simply typed λ-calculus with only finitely many elements at each type, definability (by a closed term of the calculus) is decidable. This conjecture had been shown to imply many things, for example, Statman [?] (see also Wolfram’s book [?]) has shown it implies the deci...
متن کاملOn Definability in Multimodal Logic
Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 51 شماره
صفحات -
تاریخ انتشار 2005